k-optimal Partitions of a Directed Graph
نویسنده
چکیده
A partition M is k-optimal if M minimizes BdM). For instance, if G has a Hamiltonian path J.Lo, then M = W.o} is a k -optimal partition. So the k -optimal partitions extend in some sense the concept of Hamiltonian paths. The theorem of Greene and Kleitman [10], which extends the Dilworth theorem [5], shows an important property of k-optimal partitions for the graph of a partially ordered set (in [1, 5], the k-optimal partitions are called "k-saturated"). This paper shows that similar properties also hold for several classes of graphs.
منابع مشابه
Stirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملAn Extension of the Greene and Greene-Kleitman Theorems to all Digraphs
Let G be a directed graph, and k a positive integer. We prove that there exists a kcolouring that is orthogonal to every k-optimal partition of V(G) into paths and cycles. This extends the Greene-Kleitman Theorem to all digraphs, and relates to Berge’s conjecture on path partitions and k-colourings. We also show that there exists a colouring that is orthogonal to every optimal collection of k d...
متن کاملBerge's conjecture on directed path partitions - a survey
Berge’s conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth’s Theorem and the Greene-Kleitman Theorem which are well known for partially ordered sets. The conjecture relates path partitions to a collection of k independent sets, for each k ≥ 1. The conjecture is still open and intriguing for all k > 1. In this paper, we will survey partial results on the ...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 3 شماره
صفحات -
تاریخ انتشار 1982